Termination of String Rewriting Rules That Have One Pair of Overlaps
نویسنده
چکیده
This paper presents a partial solution to the long standing open problem of termination of one rule string rewriting Overlaps between the two sides of the rule play a central role in existing termination criteria We characterize termination of all one rule string rewriting systems that have one such overlap at either end This both completes a result of Kurth and generalizes a result of Shikishima Tsuji et al
منابع مشابه
Termination by Quasi-periodic Interpretations
We present a new method for automatically proving termination of term rewriting and string rewriting. It is based on the wellknown idea of interpretation of terms in natural numbers where every rewrite step causes a decrease. In the dependency pair setting only weak monotonicity is required for these interpretations. For these we use quasiperiodic functions. It turns out that then the decreasin...
متن کاملUndecidable Properties on Length-Two String Rewriting Systems
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that confluence, termination, left-most termination and right-most termination are undecidable properties for length-two string rewriting systems. This results mean that these properties are undecidable for the class of linear term rewriting systems in which dept...
متن کاملLoops of Superexponential Lengths in One-Rule String Rewriting
Abstract. Loops are the most frequent cause of non-termination in string rewriting. In the general case, non-terminating, non-looping string rewriting systems exist, and the uniform termination problem is undecidable. For rewriting with only one string rewriting rule, it is unknown whether non-terminating, non-looping systems exist and whether uniform termination is decidable. If in the one-rul...
متن کاملTermination of String Rewriting Proved Automatieally
In this paper it is described how a combination of semantic labelling, polynomial interpretations, recursive path order and the dependency pair method can be used for automatically proving termination of an extensive class of string rewriting systems (SRSs). The tool implementing these techniques is called TORPA: Termination of Rewriting Proved Automatically. All termination proofs generated by...
متن کاملProving Termination in the Context-Sensitive Dependency Pair Framework
Termination of context-sensitive rewriting (CSR) is an interesting problem with several applications in the fields of term rewriting and in the analysis of programming languages like CafeOBJ, Maude, OBJ, etc. The dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has been adapted to be used for proving termination of CSR. The corresponding notion...
متن کامل